Node property of weighted networks considering connectability to nodes within two degrees of separation
نویسندگان
چکیده
منابع مشابه
a synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملDegrees of Separation in Social Networks
Social networks play an increasingly important role in today’s society. Special characteristics of these networks make them challenging domains for the search community. In particular, social networks of users can be viewed as search graphs of nodes, where the cost of obtaining information about a node can be very high. This paper addresses the search problem of identifying the degree of separa...
متن کاملInterdependent networks with identical degrees of mutually dependent nodes.
We study a problem of failure of two interdependent networks in the case of identical degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes N connected by the bidirectional dependency links establishing a one-to-one correspondence between the nodes of the two networks in a such a way that the mutually dependent nodes have the same number of co...
متن کاملUniversal dependence of distances on nodes degrees in complex networks
We have studied dependence of distances on nodes degrees between vertices of ErdősRényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks. We have observed that the mean distance between two nodes of degrees ki and k j equals to 〈li j〉 = A−B log(kik j). A simple heuristic theory for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2018
ISSN: 2045-2322
DOI: 10.1038/s41598-018-26781-y